Method, system and program for constructing a controller

ABSTRACT

A system, program and related computer implemented method for selecting a controller and constructing it to automate one or more processes is provided. The method comprises the steps of: constructing a controller from a plant described by an LPV model to which a scheduling parameter is given by: a) calculating one or more v gaps and a mean value of each candidate of a plant parameter vector of said LPV model based on a requirement of preselected constraints; b) choosing a candidate via information gathered by proof based on the magnitude of differences between the v gaps; c) converting the LPV model into LMI and finding controllers, according to an H ∞  criterion, at all combination end points of a maximum value and a minimum value of the plant parameter vector thus chosen; and d) choosing and constructing said chosen controller for said plant.

CROSS REFERENCES

This application claims priority under 35 U.S.C. §119 from Chinese Patent Application No. 2010-264660 filed in Japan, the entire contents of which are incorporated by reference herein.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a technique for constructing a controller such as a plant of an automobile, and more specifically to a technique for performing gain scheduled control by describing a plant by a linear-parameter variant model and converting the plant into linear matrix inequalities.

2. Description of Background

In conventional prior art methodology, to control a plant in which a constitutive parameter changes during operation, certain methodology is used that introduces variable structure control which performs the controlling function while estimating a state variable by adjusting a gain of an observer by a data map has been employed in many cases.

However, these conventional methods require a lot of efforts especially to incorporate all possibility in a data map. Further, when a map is made experimentally, it is difficult to handle the parameter change of the plant. In view of this, a gain scheduled control, which covers all cases in such a manner that a plant is described by a linear parameter-varying (LPV: Linear Parameter-Varying) model, and a variation range constraint is converted into linear matrix inequalities (LMI: Linear Matrix Inequalities), has been examined as one solution. Nonetheless, in the conventional techniques, the selection of scheduling parameter candidates to obtain sufficient performances was difficult. The selection was human-intensive and required special measures and subjective determination by observing a Bode diagram. This took time and made it difficult to choose the most suitable parameter candidate. The.

Consequently, it is desirable to implement a technique capable of automatically constructing a controller that calculates v gaps for each candidate of a plant parameter vector. It is desirous that the automatically constructed controller be based on these v gaps calculated for each candidate of a scheduling parameter vector.

SUMMARY OF THE INVENTION

The shortcomings of the prior art are overcome and additional advantages are provided through the provision of a method, system and program for constructing a controller. In one embodiment, a computer implemented method for selecting a controller from a plurality of controllers and constructing so that it can automate one or more processes used in a plant, comprising the steps of: constructing a controller from a plant described by an LPV model to which a scheduling parameter is given by: a) calculating via a processor one or more v gaps respectively for Min, Max, and a mean value of each candidate of a plant parameter vector of said LPV model based on a requirement of preselected constraints; b) the processor choosing a candidate via information gathered by proof said plant parameter vector based on the magnitude of differences between the v gaps; c) the processor converting the LPV model into LMI and finding controllers, according to an H^(∞) criterion, at all combination end points of a maximum value and a minimum value of the plant parameter vector thus chosen; and d) the processor choosing and constructing said chosen controller for said plant by using bilinear interpolation weighted by said v gaps specifically calculated for said plant parameter vector thus chosen.

Additional features and advantages are realized through the techniques of the present invention. Other embodiments and aspects of the invention are described in detail herein and are considered a part of the claimed invention. For a better understanding of the invention with advantages and features, refer to the description and to the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter which is regarded as the invention is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other objects, features, and advantages of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which:

FIG. 1 is a schematic block diagram of one exemplary control computer used in the present invention.

FIG. 2 is a functional block diagram of a program or the like for executing a process of determining a controller according to the present invention.

FIG. 3 is a view showing a flowchart for executing a process of determining a controller according to the present invention.

FIG. 4 is a view to describe the derivation of an H^(∞) criterion controller by conversion to LMI.

FIG. 5 is a view to describe the conversion from a generalized plant to an LMI problem.

DESCRIPTION OF THE INVENTION

Some of the concepts of the present invention are described in conjunction with the following exemplary embodiments of the present invention according to the figures as provided. However, it should be understood that these embodiments are intended to provide examples for ease of understanding and therefore should not be used as if intended to limit the scope of the invention. In addition, the figures as will be described, the same numerals are used to indicate the same component or function unless otherwise indicated to the contrary.

Referring now to FIG. 1, a block diagram of the hardware of a computer is provided comprising a controller 118 according to the present invention is shown. In FIG. 1, a CPU 104, a main memory (an RAM) 106, a hard disk drive (HDD) 108, a key-board 110, a mouse 112, and a display 114 are connected to a system bus 102. The CPU or the central processing unit can comprise one or more processors. Also in alternate embodiments, it is possible that the computing system shown in FIG. 1, comprises one or more other processors enabled to process one or more computing instructions as required by an embodiment of the present invention.

The CPU 104 is preferably based on architecture of 32 bits or 64 bits, and, for example, Pentium (trademark) 4 of Intel Corporation, Core (trademark) 2 DUO of Intel Corporation, Athlon (trademark) of AMD Inc. can be used. The main memory 106 preferably has a capacity of 2 GB or more, more preferably a capacity of 4 GB or more.

Into the hard disk drive 108, though they are not shown individually, an operating system, a processing program according to the present invention, and the like are stored in advance. The operating system may be anything adapting to the CPU 104, such as Linux (trademark), Windows Vista, Windows XP (trademark), and Windows (trademark) 2000, each of which is produced by Microsoft, and Mac OS (trademark) of Apple Computer, Inc.

The key-board 110 and the mouse 112 are used to operate graphic objects such as an icon, a task bar, and a window, which are displayed on the display 114, according to a graphic user interface provided by the operating system. The key-board 110 and the mouse 112 are also used to operate a data recording program, which is described later.

The display 114 is preferably an LCD monitor of 32-bit true color with a resolution of 1024×768 or more, but should not be limited to this. The display 114 is used to display a waveform and the like of operation of a plant by the controller 118. In the hard disk drive 108, an LPV model 204, a scheduling parameter 206 for the LPV model 204, a v gap-calculation module 208, an LMI conversion module 210, a controller-construction module 212, and a main program 202 to integrate overall processing, all of which will be described later, are stored. The main program 202, the v gap-calculation module 208, the LMI conversion module 210, and the controller-construction module 212 can be created by any existing programming language such as C, C++, C#, and Java(R). These modules are loaded to the main memory 106 by the operation of the operating system as appropriate for execution. Although it is not shown, the main program 202 may display a window for an operator to operate on the display 114 by an appropriate GUI, so that the operator can start or stop a process by using the key-board 110, the mouse 112, and the like.

To the bus 102, a controller 118 for controlling a plant 402 shown in FIG. 4 is connected through an appropriate interface board 116 such as PCI or USB. The controller 118 has a register in which to store a control matrix K obtained as a result of calculation through the interface board 116.

The plant 402 is, for example, a target mechanism device to be controlled, such as an engine, a brake, or an air conditioner. The plant 402 may be an actual machine, or a software-like model created with simulation modeling tools such as Simulink(R) and Modelica. When the plant 402 is a software-like model, the plant 402 is a module stored in the hard disk drive 108. In that case, since the controller 118 is also a module stored in the hard disk drive 108, the interface through the interface board 116 is unnecessary. Next will be described a logical construction of a program or the like to execute a process of determining a controller according to the present invention, with reference to a functional block diagram of FIG. 2.

A main program 202 functions to control overall operation including an interface with a user. A linear parameter-varying (LPV) model 204 is a model to describe the plant 402 by the following linear equations, and it is described beforehand by a user in consideration of a mechanics equation and the like.

{dot over (x)}(t)=A(θ(t))x(t)+B(θ(t))u(t)

y(t)=C(θ(t))x(t)+D(θ(t))u(t)

G(s,θ(t))=D(θ(t))+C(θ(t)){sI−A(θ(t))}⁻¹ B(θ(t))

{dot over (x)}(t)=A(θ(t))x(t)+B(θ(t))u(t)

y(t)=C(θ(t))x(t)+D(θ(t))u(t)

G(s, θ(t)=D(θ(t))+C(θ(t)){sI−A(θ(t))}⁻¹ B(θ(t))   [Expression 1]

In this instance A, B, C, and D are coefficient matrices of a state space model.

A scheduling parameter 206 is a time-varying parameter θ(t), which is used in the LPV model 204. As shown in the following expression, the scheduling parameter 206 is a vector of the r dimension.

θ(t)=[θ₁(t), . . . , θ_(r)(t)]^(T) ∈

^(r)   [Expression 2]

Each element θ_(j)(t) (j=1, 2, . . . , r) of θ(t) is described beforehand by the user according to system requirements. Also, for each element θ_(j)(t) (j=1, 2, . . . , r) of θ(t), a maximum value θ_(i) ^(max) and a minimum value θ_(i) ^(min), which come out of an upper requirement of constraints, are determined beforehand by the user, as shown in the following expression, and they are stored into the hard disk drive 108 as the scheduling parameter 206.

$\begin{matrix} {{\theta_{1}^{\min} \leq {\theta_{1}(t)} \leq \theta_{1}^{\max}},\ldots \mspace{14mu},{\theta_{r}^{\min} \leq {\theta_{r}(t)} \leq {\theta_{r}^{\max}.}}} & \left\lbrack {{Expression}\mspace{14mu} 3} \right\rbrack \end{matrix}$

A v gap-calculation module 208 has a function to calculate v gaps in the method described in G. Vinnicombe, “Frequency Domain Uncertainty and the Graph Topology,” IEEE Trans. Automatic Control, Vol. 38, No. 9, pp. 1371-1383, 1993, from a maximum value θ_(j) ^(max) and a minimum value θ_(j) ^(min) of the scheduling parameter 206, and a mean value θ_(j) ^(mid) therebetween. Note that the mean value θ_(j) ^(mid) is calculated as follows:

$\begin{matrix} {{\theta_{j}^{mid} = \frac{\theta_{j}^{\min} + \theta_{j}^{\max}}{2}}{\left( {{j = 1},2,\ldots \mspace{14mu},r} \right).}} & \left\lbrack {{Expression}\mspace{14mu} 4} \right\rbrack \end{matrix}$

A linear-matrix-inequality (LMI) conversion module 210 has a function to convert the LPV model 204 into LMI, and to find controllers according to an H^(∞) criterion by use of a maximum value and a minimum value of a chosen scheduling parameter.

A controller-construction module 212 constructs the controller 118 for a generalized plant by bilinear interpolation weighted by the v gaps calculated when the parameter is chosen. At this time, the construction of the controller 118 is carried out through the interface board 116 shown in FIG. 1.

With reference to the flowchart in FIG. 3, the following describes a process of determining a controller according to the present invention. In FIG. 3, in Step 302, a user describes an LPV model and also gives a scheduling parameter and the number of elements thereof. At this point, maximum values and minimum values of the elements of the scheduling parameter are also inputted according to a specification. They are independently stored in the hard disk drive 108 as the LPV model 204 and the scheduling parameter 206 of FIG. 2 by the main program 202.

In Step 304, the main program 202 accesses the v gap-calculation module 208, so that a v gap is calculated for each of Min, Max, and a mean value thereof of each candidate of the scheduling parameter vector coming out of an upper requirement of the constraints, in accordance with, for example, the method described in G. Vinnicombe, “Frequency Domain Uncertainty and the Graph Topology,” IEEE Trans. Automatic Control, Vol. 38, No. 9, pp. 1371-1383, 1993.

At first, a general calculation of the v gap is described. When transfer functions of two plant models are assumed P₁(jω) and P₂(jω), the v gap between the two transfer functions is defined as the following expression. Here, ω is an angular frequency.

Further,

$\begin{matrix} {{\delta_{v}\left( {P_{1},P_{2}} \right)} = {\sup\limits_{\infty}{\kappa \left( {{P_{1}({j\omega})},{P_{2}({j\omega})}} \right)}}} & \left\lbrack {{Expression}\mspace{14mu} 5} \right\rbrack \end{matrix}$

Here, κ(X, Y) is defined as follows:

κ(X, Y)= σ[(I+YY*)^(−1/2)(Y−X)(I+XX*)^(−1/2)]  [Expression 6]

σ  [Expression 7]

represents a maximum singular-value. If it is a single-input single-output system, the v gap is calculated as follows:

$\begin{matrix} {\delta_{v} = {\sup\limits_{\infty}{\frac{{{P_{2}({j\omega})} - {P_{1}({j\omega})}}}{\sqrt{1 + {{P_{1}({j\omega})}}^{2}}\sqrt{1 + {{P_{2}({j\omega})}}^{2}}}.}}} & \left\lbrack {{Expression}\mspace{14mu} 8} \right\rbrack \end{matrix}$

Here, in terms of the i-th element (i=1, . . . , r) of θ, a transfer function into which a maximum value thereof is substituted is assumed T_(i) ^(max), and a transfer function into which a minimum value thereof is substituted is assumed T_(i) ^(min). Further, a transfer function into which a mean value therebetween is substituted is assumed T_(i) ^(mid).

In this instance, the main program 202 accesses the v gap-calculation module 208 to calculate the following values by use of the above v gap calculation expression.

v _(i) _(—) mid_max=δ_(v)(T _(i) ^(mid) , T _(i) ^(max))

v _(i) _(—) min_mid=δ_(v)(T _(i) ^(min) , T _(i) ^(mid))

v _(i) _(—) min_max=δ_(v)(T _(i) ^(min) , T _(i) ^(max))

In Step 306, the main program 202 sequentially takes those elements as scheduling parameter candidates in the order from i with a largest value of (|v_(i) _(—) min_mid−v_(i) _(—) mid_max|+v_(i) _(—) min_max) (i=1, . . . , r), and chooses as many elements as the number of parameters that is initially given.

In the first embodiment, only a first given parameter is chosen, and in the second embodiment, a subsequently given parameter is also chosen. The first embodiment and the second embodiment will be described later.

In Step 308, the main program 202 accesses the LMI conversion module 210 to convert the LPV model 204 into LMI and to derive an H^(∞) criterion controller. At first, the generalization thereof is described. That is, a fluctuation portion of the LPV model 204 is taken as an exogenous signal. Then, a large plant for it is assumed and defined as a generalized plant 404 as shown in FIG. 4. If it is determined which parameter of the LPV model 204 is chosen as a scheduling parameter, an internal filter of the exogenous signal and the exogenous signal itself can be automatically determined from the frequency characteristic of the fluctuation portion thus chosen.

In view of this, from the viewpoint that it is a control aim to suppress a controlled variable z as small as possible to an exogenous signal w in the generalized plant 404 that can be represented by the following expression:

$\begin{matrix} {{\begin{bmatrix} x \\ y \end{bmatrix} = {{G\begin{bmatrix} w \\ u \end{bmatrix}} = {\begin{bmatrix} G_{11} & G_{12} \\ G_{21} & G_{22} \end{bmatrix}\begin{bmatrix} w \\ u \end{bmatrix}}}},} & \left\lbrack {{Expression}\mspace{14mu} 9} \right\rbrack \end{matrix}$

a controller K that makes a transfer function G_(zw) therebetween small is designed. Here, the transfer function G_(zw) is represented by the following expression:

G _(zw) =G ₁₁ +G ₁₂ K(I−G ₂₂ K)⁻¹ G ₂₁   [Expression 10]

As a measure of the magnitude of this G_(zw), an H^(∞) norm is used. This is an H^(∞) criterion. The definition thereof is as follows:

$\begin{matrix} {{{G_{zw}}_{\infty} = {\sup\limits_{\infty}{{\overset{\_}{\sigma}\left( {G_{zw}({j\omega})} \right)}.{Here}}}},} & \left\lbrack {{Expression}\mspace{14mu} 11} \right\rbrack \\ \overset{\_}{\sigma} & \left\lbrack {{Expression}\mspace{14mu} 12} \right\rbrack \end{matrix}$

represents a maximum singular-value, and ω represents an angular frequency. By this definition, the H^(∞) control problem can internally stabilize a closed loop system by a feedback control of u=Ky with respect to a generalized plant G. In the meantime, with respect to a given positive number γ, the H^(∞) control problem can be formulated to obtain a controller K that satisfies the following expression:

∥G∥_(∞)<γ.   [Expression 13]

Here, γ may be given optionally, but as a conventional technique, there is a method in which γ may be determined automatically. One approach to solve this is a technique according to LMI. That is, when only parts corresponding to z and w are taken out and assumed as follows:

{dot over (x)}=Ax+Bw

z=Cx+Dw,   [Expression 14]

The following two conditions are equivalent according to a certain theorem. (i) A matrix A is stable, and in the block shown in FIG. 5, the following expression is formed:

∥G∥_(∞)<γ.   [Expression 15]

(ii) There exists X>0, which satisfies the following expression:

$\begin{matrix} {{X > 0},{\begin{bmatrix} {{AX} + {XA}^{T}} & B & {XC}^{T} \\ B^{T} & {{- \gamma}\; I} & D^{T} \\ {CX} & D & {{- \gamma}\; I} \end{bmatrix} < 0.}} & \left\lbrack {{Expression}\mspace{14mu} 16} \right\rbrack \end{matrix}$

In other words, the condition (i) is the aforementioned H^(∞) criterion, and a matrix X that satisfies the H^(∞) criterion is a controller. Further, when a solution that satisfies linear matrix inequalities (LMI) about X in the condition (ii) is found, a controller based on the H^(∞) standard is obtained.

Generally, in the case of a feedback control, even if variables are just substituted as they are, this does not make a linear for X. Therefore, a change of the variables or the like is performed so as to make the above form. As for the technical details thereof, S. Aubouet et al., “H-infinity/LPV observer for an industrial semi-active suspension,” IEEE Proc. Conf. on Control Applications, pp. 756-763, 2009, can be also referred to as appropriate.

On the other hand, w cannot be inputted with respect to all the scheduling parameters. In view of this, in Step 308, the main program 202 calculates controllers at end points according to the H^(∞) criterion using the LMI by use of the LMI conversion module 210. Then, in Step 310, the main program 202 constructs a controller for a generalized plant by bilinear interpolation weighted by the v gaps calculated when the parameter is chosen.

Note that, in the conventional technique, it has been implicitly assumed that the controller K for a generalized plant can be expressed by affine transformation as follows:

$\begin{matrix} {{K = {\sum\limits_{i = 1}^{N}{p_{i}K^{(i)}}}},{{\sum\limits_{i = 1}^{N}p_{i}} = 1.}} & \left\lbrack {{Expression}\mspace{14mu} 17} \right\rbrack \end{matrix}$

Here, K^((i)) is the i-th controller.

It is one of the characteristics of the present invention that this is replaced to the bilinear interpolation weighted by v gaps calculated when a parameter is chosen, as follows:

$\begin{matrix} {{K = {\sum\limits_{i = 1}^{N}{q_{i}K^{(i)}}}},{{\sum\limits_{i = 1}^{N}q_{i}} = 1},{q_{i} = {\frac{v_{i}p_{i}}{\sum\limits_{i = 1}^{N}{v_{i}p_{i}}}.}}} & \left\lbrack {{Expression}\mspace{14mu} 18} \right\rbrack \end{matrix}$

How many parameters are chosen as N is different between the embodiments. In the first embodiment, only a first given parameter is chosen. That is, with respect to the parameter, a controller is constructed by bilinear interpolation where K⁽¹⁾ is assumed a controller fixed to min, K⁽²⁾ is assumed a controller fixed to max, v₁ is assumed a v gap between transfer functions respectively fixed to min and mid, v₂ is assumed a v gap between transfer functions respectively fixed to mid and max, and p₁ and p₂ are given as the following expressions:

$\begin{matrix} {{p_{1} = \frac{{\theta_{1}(t)} - \theta_{1}^{\min}}{\theta_{1}^{\max} - \theta_{1}^{\min}}},{p_{2} = {1 - {p_{1}.}}}} & \left\lbrack {{Expression}\mspace{14mu} 19} \right\rbrack \end{matrix}$

In the second embodiment, two parameters, i.e., a first given parameter and a subsequent parameter are chosen. That is, with respect to those parameters, a controller is constructed by bilinear interpolation where a controller designed at an end point of {p1_min, p2_min} is assumed K⁽¹⁾, a controller designed at an end point of {p1_min, p2_max} is assumed K⁽²⁾, a controller designed at an end point of {p1_max, p2_min} is assumed K⁽³⁾, a controller designed at an end point of {p1_max, p2_max} is assumed K⁽⁴⁾, a v gap between transfer functions respectively fixed to p1_min and p2_min is assumed v₁, a v gap between transfer functions respectively fixed to p1_min and p2_max is assumed v₂, a v gap between transfer functions respectively fixed to p1_max and p2_min is assumed v₃, a v gap between transfer functions respectively fixed to p1_max and p2_max is assumed v₄, and p₁, p₂, p₃, and p₄ are given as the following expressions:

$\begin{matrix} {{p_{1} = \frac{\left( {{\theta_{1}(t)} - \theta_{1}^{\min}} \right)\left( {{\theta_{2}(t)} - \theta_{2}^{\min}} \right)}{\left( {\theta_{1}^{\max} - \theta_{1}^{\min}} \right)\left( {\theta_{2}^{\max} - \theta_{2}^{\min}} \right)}}{p_{2} = \frac{\left( {{\theta_{1}(t)} - \theta_{1}^{\min}} \right)\left( {\theta_{2}^{\max} - {\theta_{2}(t)}} \right)}{\left( {\theta_{1}^{\max} - \theta_{1}^{\min}} \right)\left( {\theta_{2}^{\max} - \theta_{2}^{\min}} \right)}}{p_{3} = \frac{\left( {\theta_{1}^{\max} - {\theta_{1}(t)}} \right)\left( {{\theta_{2}(t)} - \theta_{2}^{\min}} \right)}{\left( {\theta_{1}^{\max} - \theta_{1}^{\min}} \right)\left( {\theta_{2}^{\max} - \theta_{2}^{\min}} \right)}}{p_{4} = {\frac{\left( {\theta_{1}^{\max} - {\theta_{1}(t)}} \right)\left( {\theta_{2}^{\max} - {\theta_{2}(t)}} \right)}{\left( {\theta_{1}^{\max} - \theta_{1}^{\min}} \right)\left( {\theta_{2}^{\max} - \theta_{2}^{\min}} \right)}.}}} & \left\lbrack {{Expression}\mspace{14mu} 20} \right\rbrack \end{matrix}$

The use of weighting by the v gaps rather than the linear interpolation according to the characteristic of the present invention takes into consideration a geodesic distance of the non-Euclidean geometry, thereby lowering the error of the feedback control.

Note that such an embodiment in which three or more parameters may be chosen to construct a controller can be considered. However, it is desirable to keep the number of parameters to choose within a proper number, because when the number of parameters to choose is so large, a controller may be complicated and may not function in some cases.

The embodiments of the present invention have been described as above, but it will be understandable for a person skilled in the art that the present invention is not limited to a platform such as specific hardware or software, but is realizable on any given platform.

DESCRIPTION OF REFERENCE NUMERALS

102 System Bus

104 CPU

106 Main Memory

108 Hard Disk Drive

114 Display

116 Interface Board

118 Controller

202 Main Program

204 LPV Model

206 Scheduling Parameter

208 Gap-calculation Module

210 Conversion Module

212 Controller-construction Module

402 Plant

404 Generalized plant 

What is claimed is:
 1. A computer implemented method for selecting a controller from a plurality of controllers and constructing so that it can automate one or more processes used in a plant, comprising the steps of: constructing a controller from a plant described by an LPV model to which a scheduling parameter is given by: a) calculating via a processor one or more v gaps respectively for Min, Max, and a mean value of each candidate of a plant parameter vector of said LPV model based on a requirement of preselected constraints; b) said processor choosing a candidate via information gathered by proof said plant parameter vector based on the magnitude of differences between said v gaps; c) said processor converting the LPV model into LMI and finding controllers, according to an H^(∞) criterion, at all combination end points of a maximum value and a minimum value of the plant parameter vector thus chosen; and d) said processor choosing and constructing said chosen controller for said plant by using bilinear interpolation weighted by said v gaps specifically calculated for said plant parameter vector thus chosen.
 2. The method according to claim 1, wherein said processor calculates said v gaps, using a transfer function into which a maximum value of an i-th element of the scheduling parameter is substituted is assumed T_(i) ^(max), a transfer function into which a minimum value thereof is substituted is assumed T_(i) ^(min), a transfer function into which a mean value thereof is substituted is assumed T_(i) ^(mid), and δ_(v)( ) is assumed as a function and said values are calculated by said processor using the formula: v _(i) _(—) mid_max=δ_(v)(T _(i) ^(mid) , T _(i) ^(max)) v _(i) _(—) min_mid=δ_(v)(T _(i) ^(min) , T _(i) ^(mid)) v _(i) _(—) min_max=δ_(v)(T _(i) ^(min) , T _(i) ^(max))
 3. The method according to claim 2, wherein said processor chooses a candidate based on said plant parameter vector and based on a value of (|v_(i) _(—) min_mid−v_(i) _(—) mid_max|+v_(i) _(—) min_max).
 4. The method according to claim 3, wherein in step of selecting candidates only one candidate having a largest value of (|v_(i) _(—) min_mid−v_(i) _(—) mid_max|+v_(i) _(—) min_max) is chosen, such that bilinear interpolation is performed at two points to which min and max of the parameter thus chosen are fixed, respectively.
 5. The method according to claim 2, wherein said step of choosing a candidate includes choosing a plurality of candidates such that at least one candidate with a largest value of (|v_(i) _(—) min_mid−v_(i) _(—) mid_max|+v_(i) _(—) min_max) and another candidate with a second largest value of (|v_(i) _(—) min_mid−v_(i) _(—) mid_max|+v_(i) _(—) min_max), are chosen, such that bilinear interpolation is performed at four points to which p1_min and p2_min, p1_min and p2_max, p1_max and p2_min, and p1_max and p2_max are fixed, respectively, where p1 indicates said candidate with said largest value and p2 indicates the candidate with said second largest value.
 6. A computer processor enabled to execute a program for constructing a controller from a plant described by an LPV model to which a scheduling parameter is given, comprising the steps of: said processor calculating v gaps respectively for Min, Max, and a mean value of each candidate of a plant parameter vector of the LPV model based on a requirement of constraints; said processor choosing a candidate of the plant parameter vector based on the magnitude of differences between the v gaps; said processor converting the LPV model into LMI and finding controllers, according to an H^(∞) criterion, at all combination end points of a maximum value and a minimum value of the plant parameter vector thus chosen; and said processor constructing a controller for the plant by bilinear interpolation weighted by the v gaps calculated for the plant parameter vector thus chosen.
 7. The computer processor of claim 6, wherein said processor calculates v gaps, via a transfer function into which a maximum value of an i-th element of said scheduling parameter is substituted is assumed T_(i) ^(max), a transfer function into which a minimum value thereof is substituted is assumed T_(i) ^(min), a transfer function into which a mean value thereof is substituted is assumed T_(i) ^(mid), and δ_(v)( ) is assumed using formula: v _(i) _(—) mid_max=δ_(v)(T _(i) ^(mid) , T _(i) ^(max)) v _(i) _(—) min_mid=δ_(v)(T _(i) ^(min) , T _(i) ^(mid)) v _(i) _(—) min_max=δ_(v)(T _(i) ^(min) , T _(i) ^(max))
 8. The computer processor of claim 7, wherein said candidate is chosen by using said plant parameter vector is chosen based on a value of (|v_(i) _(—) min_mid−v_(i) _(—) mid_max|+v_(i) _(—) min_max).
 9. The program according to claim 7, wherein said step of choosing a candidate includes choosing a plurality of candidates such that at least one candidate with a largest value of (|v_(i) _(—) min_mid−v_(i) _(—) mid_max|+v_(i) _(—) min_max) and another candidate with a second largest value of (|v_(i) _(—) min_mid−v_(i) _(—) mid_max|+v_(i) _(—) min_max), are chosen, such that bilinear interpolation is performed at four points to which p1_min and p2_min, p1_min and p2_max, p1_max and p2_min, and p1_max and p2_max are fixed, respectively, where p1 indicates said candidate with said largest value and p2 indicates the candidate with said second largest value.
 10. A computer implemented system for constructing a controller from a plant described by an LPV model to which a scheduling parameter is given, the system comprising: a memory means; an LPV model and its scheduling parameter which are stored in the memory means; one or more processors enabled to calculating v gaps respectively for Min, Max, and a mean value of each candidate of a plant parameter vector of the LPV model based on a requirement of constraints; said processor having means for choosing a candidate of the plant parameter vector based on the magnitude of differences between the v gaps and for converting the LPV model into LMI and finding controllers, according to an H^(∞) criterion, at all combination end points of a maximum value and a minimum value of the plant parameter vector thus chosen; and said processor having means for constructing a controller for the plant by bilinear interpolation weighted by the v gaps calculated for the plant parameter vector thus chosen.
 11. The system according to claim 10, wherein said processor calculates v gaps, via a transfer function into which a maximum value of an i-th element of said scheduling parameter is substituted is assumed T_(i) ^(max), a transfer function into which a minimum value thereof is substituted is assumed T_(i) ^(min), a transfer function into which a mean value thereof is substituted is assumed T_(i) ^(mid), and δ_(v)( ) is assumed using formula: v _(i) _(—) mid_max=δ_(v)(T _(i) ^(mid) , T _(i) ^(max)) v _(i) _(—) min_mid=δ_(v)(T _(i) ^(min) , T _(i) ^(mid)) v _(i) _(—) min_max=δ_(v)(T _(i) ^(min) , T _(i) ^(max))
 12. The system according to claim 10 wherein said candidate is chosen by using said plant parameter vector is chosen based on a value of (|v_(i) _(—) min_mid−v_(i) _(—) mid_max|+v_(i) _(—) min_max).
 13. The system according to claim 10, wherein said step of choosing a candidate includes choosing a plurality of candidates such that at least one candidate with a largest value of (|v_(i) _(—) min_mid−v_(i) _(—) mid_max|+v_(i) _(—) min_max) and another candidate with a second largest value of (|v_(i) _(—) min_mid−v_(i) _(—) mid_max|+v_(i) _(—) min_max), are chosen, such that bilinear interpolation is performed at four points to which p1_min and p2_min, p1_min and p2_max, p1_max and p2_min, and p1_max and p2_max are fixed, respectively, where p1 indicates said candidate with said largest value and p2 indicates the candidate with said second largest value. 